#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e5+10;
int n,a[MAXN];
bool flag=1;
queue<int> q;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    sort(a+1,a+1+n);
    for(int i=2;i<=n;i++)
    {
         if(a[i]==a[i-1])
         {
             flag=0;
             break;
         }
    }
    if(flag)
    {
        cout<<1;
        return 0;
    }
    for(int i=1;i<=n;i++)
    {
        if(q.front()>=a[i]||q.empty())
            q.push(a[i]);
        else
        {
            q.pop();
            q.push(a[i]);
        }
    }
    int ans=0;
    while(!q.empty())
    {
        q.pop();
        ans++;
    }
    cout<<ans;
    return 0;
}
